Quantifiers and Congruence Closure

نویسندگان

  • Jörg Flum
  • Matthias Schiehlen
  • Jouko A. Väänänen
چکیده

We prove some results about the limitations of the expressive power of quantiiers on nite structures. We deene the concept of a bounded quantiier and prove that every relativizing quantiier which is bounded is already rst-order deenable (Theorem 3.8). We weaken the concept of congruence closed (see 6]) to weakly congruence closed by restricting to congruence relations where all classes have the same size. Adapting the concept of a thin quantiier (Caicedo 1]) to the framework of nite structures, we deene the concept of a meager quantiier. We show that no proper extension of rst-order logic by means of meager quantiiers is weakly congruence closed (Theorem 4.9). We prove the failure of the full congruence closure property for logics which extend rst-order logic by means of meager quantiiers, arbitrary monadic quantiiers, and the HH artig quantiier (Theorem 6.1).

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A double arity hierarchy theorem for transitive closure logic

In this paper we prove that the k–ary fragment of transitive closure logic is not contained in the extension of the (k − 1)–ary fragment of partial fixed point logic by all (2k − 1)–ary generalized quantifiers. As a consequence, the arity hierarchies of all the familiar forms of fixed point logic are strict simultaneously with respect to the arity of the induction predicates and the arity of ge...

متن کامل

Definability properties and the congruence closure

We introduce a natural class of quantifiers Th containing all monadic type quantifiers, all quantifiers for linear orders, quantifiers for isomorphism, Ramsey type quantifiers, and plenty more, showing that no sublogic of Lo~o,(Th) or countably compact regular sublogic of L~o,(Th), properly extending L,o,o, satisfies the uniform reduction property for quotients. As a consequence, none of these ...

متن کامل

Congruence Closure with Free Variables

Many verification techniques nowadays successfully rely on SMT solvers as back-ends to automatically discharge proof obligations. These solvers generally rely on various instantiation techniques to handle quantifiers. We here show that the major instantiation techniques in SMT solving can be cast in a unifying framework for handling quantified formulas with equality and uninterpreted functions....

متن کامل

Commutative Locative Quantifiers for Multiplicative Linear Logic

The paper presents a solution to the technical problem posed by Girard after the introduction of Ludics of how to define proof nets with quantifiers that commute with multiplicatives. According to the principles of Ludics, the commuting quantifiers have a “locative” nature, in particular, quantified formulas are not defined modulo variable renaming. The solution is given by defining a new corre...

متن کامل

Contents 1 A Note from the Organizers

Congruence Closure and Applications Congruence closure algorithms for solving word problems for finitely pre-sented algebras have also been used in combining decision procedures. Onthe other hand, congruence closure can itself be looked upon as a combina-tion problem. Taking this view leads us to define the notion of an abstractcongruence closure. We present a completion based d...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Studia Logica

دوره 62  شماره 

صفحات  -

تاریخ انتشار 1999